Evolutionary algorithms and dynamic programming
نویسندگان
چکیده
منابع مشابه
Genetic and Evolutionary Algorithms and Programming
98. Nelson DB (1990) Stationarity and persistence in the GARCH(1,1) model. Econom Theory 6:318–334 99. Nelson DB (1991) Conditional heteroskedasticity in asset returns: A new approach. Econometrica 59:347–370 100. Nelson DB, Cao CQ (1992) Inequality constraints in the univariate garchmodel. J Bus Econ Stat 10:229–235 101. Newey WK, Steigerwald DS (1997) Asymptotic bias for quasi maximum likelih...
متن کاملDynamic Programming Algorithms
The setting is as follows. We wish to find a solution to a given problem which optimizes some quantity Q of interest; for example, we might wish to maximize profit or minimize cost. The algorithm works by generalizing the original problem. More specifically, it works by creating an array of related but simpler problems, and then finding the optimal value of Q for each of these problems; we calc...
متن کاملStaging Dynamic Programming Algorithms
Applications of dynamic programming (DP) algorithms are numerous, and include genetic engineering and operations research problems. At a high level, DP algorithms are specified as a system of recursive equations implemented using memoization. The recursive nature of these equations suggests that they can be written naturally in a functional language. However, the requirement for memoization pos...
متن کاملApproximate Dynamic Programming—ii: Algorithms
• Option Pricing. An American option allows us to buy or sell an asset at any time up to a specified time, where we make money when the price goes under or over (respectively) a set strike price. Valuing the option requires finding an optimal policy for determining when to exercise the option. • Playing Games. Computer algorithms have been designed to play backgammon, bridge, chess, and recentl...
متن کاملEvolutionary algorithms and dynamic optimization problems
2003 2 3 Summary This thesis examines evolutionary algorithms, a universal optimization method, applied to dynamic problems, i.e. the problems are changing during optimization. The thesis is motivated by a lack of foundations for the field and the incomparability of most publications that are of an empirical nature. To establish a basis for the comparison of evolutionary algorithms applied to d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.07.024